package com.wc.alorithm_luogu.P1304;

import java.util.Scanner;

/**
 * @Author congge
 * @Date 2023/4/24 15:06
 * @description https://www.luogu.com.cn/problem/P1304
 * 哥德巴赫猜想
 */
public class Main {
    static boolean[] primes = new boolean[10001];

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        for (int i = 2; i <= n; i++) {
            primes[i] = isPrime(i);
        }

        StringBuilder ans = new StringBuilder();
        for (int i = 4; i <= n; i += 2) {
            ans.append(i);
            ans.append('=');
            for (int j = 2; j <= i; j++) {
                if (primes[j] && primes[i - j]) {
                    ans.append(j);
                    ans.append('+');
                    ans.append(i - j);
                    break;
                }
            }
            ans.append('\n');
        }
        System.out.print(ans);
    }

    public static boolean isPrime(int num) {
        if (num == 1) {
            return false;
        }
        int mid = (int) Math.pow(num, 0.5);

        for (int i = 2; i <= mid; i++) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }

}
